Quad Layouts via Constrained T?Mesh Quantization

نویسندگان

چکیده

We present a robust and fast method for the creation of conforming quad layouts on surfaces. Our algorithm is based quantization T-mesh, i.e. an assignment integer lengths to sides non-conforming rectangular partition surface. This representation has benefit being able encode infinite number layout connectivity options in finite manner, which guarantees that valid can always be found. carefully construct T-mesh from given seamless parametrization such provide results' quality. In particular, user specify bound angular deviation edges prescribed directions. solve linear program (ILP) find coarse adhering maximal deviation. guaranteed yield free T-junctions together with bounded angle distortion. results show presented fast, reliable, achieves high quality layouts.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Orientation-Constrained Rectangular Layouts

We construct partitions of rectangles into smaller rectangles from an input consisting of a planar dual graph of the layout together with restrictions on the orientations of edges and junctions of the layout. Such an orientationconstrained layout, if it exists, may be constructed in polynomial time, and all orientation-constrained layouts may be listed in polynomial time per layout.

متن کامل

Quad layouts: generation and optimization of conforming quadrilateral surface partitions

The efficient, computer aided or automatic generation of quad layouts, i.e. the partitioning of an object’s surface into simple networks of conforming quadrilateral patches, is a task that – despite its importance and utility in Computer Graphics and Geometric Modeling – received relatively low attention in the past. As a consequence, this task is most often performed manually by well-trained e...

متن کامل

Geometric abstractions for constrained optimization of layouts . ∗

We discuss implementation of algorithms for constrained optimization, based on CLOS objects representing standard mathematical abstractions like affine spaces, vectors , and linear transformations. These abstractions simplify using the optimization library in varied applications, facilitate animation, carry no significant performance penalty (compared to traditional Fortran implementations). Ou...

متن کامل

Entropy-constrained Vector Quantization

| Entropy-constrained vector quantization (ECVQ) 3] offers substantially improved image quality over vector quan-tization (VQ) at the cost of additional encoding complexity. We extend results in the literature for fast nearest neighbor search of VQ to ECVQ. We use a new, easily computed distance that successfully eliminates most codewords from consideration.

متن کامل

Entropy-constrained vector quantization

Akfmct-An iterative descent algorithm based on a Lagrangian formulation is introduced for designing vector quantizers having minimum distortion subject to an entropy constraint. These entropy-constrained vector quantizers (ECVQ’s) can be used in tandem with variable rate noiseless coding systems to provide locally optimal variable rate block source coding with respect to a fidelity criterion. E...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Graphics Forum

سال: 2021

ISSN: ['1467-8659', '0167-7055']

DOI: https://doi.org/10.1111/cgf.142634